منابع مشابه
Indexing Straight-Line Programs∗
Straight-line programs offer powerful text compression by representing a text T [1, u] in terms of a context-free grammar of n rules, so that T can be recovered in O(u) time. However, the problem of operating the grammar in compressed form has not been studied much. We present the first grammar representation able of extracting text substrings, and of searching the text for patterns, in time o(...
متن کاملStraight Line Triangle Representations
A straight line triangle representation (SLTR) of a planar graph is a straight line drawing such that all the faces including the outer face have triangular shape. Such a drawing can be viewed as a tiling of a triangle using triangles with the input graph as skeletal structure. In this paper we present a characterization of graphs that have an SLTR. The charcterization is based on flat angle as...
متن کاملSemantic Analysis of Straight Line C Code with Pointers
Automatic parallelization of C language programs is a subject rarely addressed: this can be explained by the diiculties inherent to the language, such as side eeects within expressions or access to memory via pointers. The method we describe here is based on a semantic analysis of programs. The goal is to detect parallelism in complex programs using pointer arithmetic, thanks to the type system...
متن کاملStraight-Line Program Length as a Parameter for Complexity Analysis
A definition is proposed for a size measure to be used as a parameter for algorithm analysis in any algebra. The parameter is simply the straight-line program length in the associated free algebra. This parameter generalizes the usual measures in basic arithmetic and string algebras, as well as some apparently different measures used for data structure algorithms. Another use is illustrated wit...
متن کاملA straight line detection using principal component analysis
A straight line detection algorithm is presented. The algorithm separates row and column edges from edge image using their primitive shapes. The edges are labeled, and the principal component analysis (PCA) is performed for each labeled edges. With the principal components, the algorithm detects straight lines and their orientations, which is useful for various intensive applications. Our algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1960
ISSN: 0028-0836,1476-4687
DOI: 10.1038/188176b0